Maximal and supremal tolerances in multiobjective linear programming
نویسندگان
چکیده
Let a multiobjective linear programming problem and any efficient solution be given. Tolerance analysis aims to compute interval tolerances for (possibly all) objective function coefficients such that the efficient solution remains efficient for any perturbation of the coefficients within the computed intervals. The known methods yield tolerances that are not optimal. In this paper, we propose a method for calculating the supremal tolerance (the maximal one needn’t exist). The method is exponential in the worst case. We show that the problem of determining the maximal/supremal tolerance is NP-hard, so an efficient procedure is not likely to exist.
منابع مشابه
Additive and multiplicative tolerance in multiobjective linear programming
We consider a multiobjective linear program and the coefficients of the multiobjective function are subject to some uncertainties. Let x be an efficient point. We propose a procedure to compute an additive and multiplicative (percentage) tolerance in which all the objective function coefficients may simultaneously and independently vary while preserving the efficiency of x. Although the toleran...
متن کاملFUZZY GOAL PROGRAMMING TECHNIQUE TO SOLVE MULTIOBJECTIVE TRANSPORTATION PROBLEMS WITH SOME NON-LINEAR MEMBERSHIP FUNCTIONS
The linear multiobjective transportation problem is a special type of vector minimum problem in which constraints are all equality type and the objectives are conicting in nature. This paper presents an application of fuzzy goal programming to the linear multiobjective transportation problem. In this paper, we use a special type of nonlinear (hyperbolic and exponential) membership functions to ...
متن کاملA Survey on Different Solution Concepts in Multiobjective Linear Programming Problems with Interval Coefficients
Optimization problems have dedicated a branch of research to themselves for a long time ago. In this field, multiobjective programming has special importance. Since in most real-world multiobjective programming problems the possibility of determining the coefficients certainly is not existed, multiobjective linear programming problems with interval coefficients are investigated in this paper. C...
متن کاملSolving multiobjective linear programming problems using ball center of polytopes
Here, we aim to develop a new algorithm for solving a multiobjective linear programming problem. The algorithm is to obtain a solution which approximately meets the decision maker's preferences. It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution. Numerical examples and a simulation study are used to illu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- European Journal of Operational Research
دوره 228 شماره
صفحات -
تاریخ انتشار 2013